In this paper, we propose a new ensemble of rateless forward error correction(FEC) codes. The proposed codes are serially concatenated codes withReed-Solomon (RS) codes as outer codes and Kite codes as inner codes. The innerKite codes are a special class of prefix rateless low-density parity-check(PRLDPC) codes, which can generate potentially infinite (or as many asrequired) random-like parity-check bits. The employment of RS codes as outercodes not only lowers down error-floors but also ensures (with highprobability) the correctness of successfully decoded codewords. In addition tothe conventional two-stage decoding, iterative decoding between the inner codeand the outer code are also implemented to improve the performance further. Theperformance of the Kite codes under maximum likelihood (ML) decoding isanalyzed by applying a refined Divsalar bound to the ensemble weightenumerating functions (WEF). We propose a simulation-based optimization methodas well as density evolution (DE) using Gaussian approximations (GA) to designthe Kite codes. Numerical results along with semi-analytic bounds show that theproposed codes can approach Shannon limits with extremely low error-floors. Itis also shown by simulation that the proposed codes performs well within a widerange of signal-to-noise-ratios (SNRs).
展开▼
